/*
  SOLID - Interference Detection Library
  Copyright (C) 1997 Gino van den Bergen

  This library is free software; you can redistribute it and/or
  modify it under the terms of the GNU Library General Public
  License as published by the Free Software Foundation; either
  version 2 of the License, or (at your option) any later version.

  This library is distributed in the hope that it will be useful,
  but WITHOUT ANY WARRANTY; without even the implied warranty of
  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  Library General Public License for more details.

  You should have received a copy of the GNU Library General Public
  License along with this library; if not, write to the Free
  Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.

  Please send remarks, questions and bug reports to gino@win.tue.nl,
  or write to:
                  Gino van den Bergen
		  Department of Mathematics and Computing Science
		  Eindhoven University of Technology
		  P.O. Box 513, 5600 MB Eindhoven, The Netherlands
*/

#include "Shape.h"
#include "PointBuf.h"
#include "Transform.h"

#include <new.h>

Shape::~Shape() {
  for (iterator i = begin(); i != end(); ++i) delete *i;
}

void Shape::finish() {
  new(&tree) BBoxTree(size(), &front());
}

bool intersect(const Shape& a, const Shape& b, const Transform& t) {
  Matrix m = t.getOrientation().absolute();
  return intersect(a.tree, b.tree, t, m);
}

void intersect(const Shape& a, const Shape& b, const Transform& t, 
	       PointBuf& report) {
  Matrix m = t.getOrientation().absolute();
  intersect(a.tree, b.tree, t, m, report);
}



